LICOS-REPORT-2006-004 The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case
نویسندگان
چکیده
We consider the problem of compressing a binary symmetric i.i.d. source stream for two decoders, one of which has access to sideinformation. Kaspi found the rate-distortion tradeoff for this problem for general discrete memoryless sources for the two cases with and without encoder side-information. We focus on the case in which the encoder has access to side-information. We assume that the source has a symmetric Bernoulli distribution and that the side-information sequence is the output of an erasure channel whose input is the source stream. We explicitly solve the optimization problem for this setup. We also show that the Wyner-Ziv rate distortion function and the conditional rate-distortion function coincide for general discrete memoryless sources when the side-information is of the erasure type.
منابع مشابه
Rate-Distortion with a Limited-Rate Helper to the Encoder and Decoder
Consider the rate-distortion problem, in which a helper sends a common limited-rate message both to the encoder and decoder based on side information at its disposal. We characterize the region of achievable rates and distortions for this problem. We derive these regions explicitly for binary doubly symmetric sources with Hamming distortion, and for Gaussian sources with square error distortion...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Structure Theorems for Real- Time Variable Rate Coding With and Without Side Information
The output of a discrete Markov source is to be encoded instantaneously by a variable–rate encoder and decoded by a finite–state decoder. Our performance measure is a linear combination of the distortion and the instantaneous rate. Structure theorems, pertaining to the encoder and next–state functions are derived for every given finite–state decoder, which can have access to side information.
متن کاملHeegard-Berger and Cascade Source Coding Problems with Common Reconstruction Constraints
In lossy source coding with side information at the decoder (i.e., the Wyner-Ziv problem), the estimate of the source obtained at the decoder cannot be generally reproduced at the encoder, due to its dependence on the side information. In some applications this may be undesirable, and a Common Reconstruction (CR) requirement, whereby one imposes that the encoder and decoder be able to agree on ...
متن کاملNon-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems
In this paper, we revisit two multi-terminal lossy source coding problems: the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994), and the multiple description coding problem with one semi-deterministic distortion measure, which we refer to as the Fu-Yeung problem (Fu and Yeung, 2002). For the ...
متن کاملDistortion Minimization in Gaussian Source Coding with Fading Side Information
We consider a layered approach to source coding that minimizes expected distortion when side information is available through a fading channel. Specifically, we assume a Gaussian source encoder whereby the decoder receives a compressed version of the symbol at a given rate, as well as an uncompressed version over a separate side-information channel with slow fading and noise. The decoder knows ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007